Local Search and Modal Logic
نویسندگان
چکیده
Local search techniques have widespread use for solving propositional satisfiability problems. We investigate the use of adaptive local search techniques for model generation problems for modal logics; we focus on the modal logic S5. A local search algorithm extended with an adaptive heuristic is presented and tested on an ensemble of randomly generated problem instances. We briefly discuss the limitations of using local search for other NP-complete modal logics.
منابع مشابه
Suhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملModal Logics with a Hierarchy of Local Propositional Quantiiers (extended Abstract)
Local propositions arise in the context of the semantics for logics of knowledge in multi-agent systems. A proposition is local to an agent when it depends only on that agent's local state. We consider a logic that extends S5, the modal logic of necessity (in which the modality refers to truth at all worlds) by adding a quantiier ranging over the set of all propositions and, for each agent, a p...
متن کاملModal Logics with a Linear Hierarchy of Local Propositional Quantifiers
Local propositions arise in the context of the semantics for logics of knowledge in multi-agent systems. A proposition is local to an agent when it depends only on that agent’s local state. We consider a logic, LLP, that extends S5, the modal logic of necessity (in which the modality refers to truth at all worlds) by adding a quantifier ranging over the set of all propositions and, for each age...
متن کاملOn the Progression of Knowledge in the Situation Calculus
In a seminal paper, Lin and Reiter introduced the notion of progression for basic action theories in the situation calculus. Earlier works by Moore, Scherl and Levesque extended the situation calculus to account for knowledge. In this paper, we study progression of knowledge in the situation calculus. We first adapt the concept of bisimulation from modal logic and extend Lin and Reiter’s notion...
متن کاملSocial Emotional Optimization Algorithm with Random Emotional Selection Strategy
With the industrial and scientific developments, many new optimization problems are needed to be solved. Several of them are complex, multi-modal, high dimensional, nondifferential problems. Therefore, some new optimization techniques have been designed, such as genetic algorithm, simulated annealing algorithm, Tabu search, etc. However, due to the large linkage and correlation among different ...
متن کامل